Enumerating permutation polynomials over finite fields by degree II
نویسندگان
چکیده
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formula for the number of permutations for which the associated permutation polynomial has d coefficients in specified fixed positions equal to 0. This also applies to the function Nq,d that counts the number of permutations for which the associated permutation polynomial has degree < q − d− 1. Next we adopt a more precise approach to show that the asymptotic formula Nq,d ∼ q!/qd holds for d ≤ αq and α = 0.03983.
منابع مشابه
Enumerating permutation polynomials
We consider the problem of enumerating polynomials over Fq, that have certain coefficients prescribed to given values and permute certain substructures of Fq. In particular, we are interested in the group of N -th roots of unity and in the submodules of Fq. We employ the techniques of Konyagin and Pappalardi to obtain results that are similar to their results in [Finite Fields and their Applica...
متن کاملEnumerating Permutation Polynomials over Finite Fields by Degree
fσ has the property that fσ(a) = σ(a) for every a ∈ Fq and this explains its name. For an account of the basic properties of permutation polynomials we refer to the book of Lidl and Niederreiter [5]. From the definition, it follows that for every σ ∂(fσ) ≤ q − 2. A variety of problems and questions regarding Permutation polynomials have been posed by Lidl and Mullen in [3, 4]. Among these there...
متن کاملEnumerating permutation polynomials II: k-cycles with minimal degree
We consider the function m[k](q) that counts the number of cycle permutations of a finite field Fq of fixed length k such that their permutation polynomial has the smallest possible degree. We prove the upper–bound m[k](q) ≤ (k−1)!(q(q−1))/k for char(Fq) > e(k−3)/e and the lower–bound m[k](q) ≥ φ(k)(q(q−1))/k for q ≡ 1 (mod k). This is done by establishing a connection with the Fq–solutions of ...
متن کاملCorrigendum to "enumerating permutation polynomials - I: Permutations with non-maximal degree": [Finite Fields Appl. 8 (2002) 531-547]
Let Fq be a finite field with q elements and suppose C is a conjugation class of permutations of the elements of Fq . We denote by C = (c1; c2; . . . ; ct ) the conjugation class of permutations that admit a cycle decomposition with ci i-cycles (i = 1, . . . , t). Further, we set c = 2c2+· · ·+ tct = q−c1 to be the number of elements of Fq moved by any permutation in C. If ∈ C, then the permuta...
متن کاملPermutation Polynomials and Resolution of Singularities over Finite Fields
A geometric approach is introduced to study permutation polynomials over a finite field. As an application, we prove that there are no permutation polynomials of degree 2/ over a large finite field, where / is an odd prime. This proves that the Carlitz conjecture is true for n = 21. Previously, the conjecture was known to be true only for n < 16.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 12 شماره
صفحات -
تاریخ انتشار 2006